Oded Goldreich - PDFSEARCH.IO - Document Search Engine

Oded Goldreich
Results: 40

#	Item
21	On the (Im)possibility of Obfuscating Programs∗ Boaz Barak† Oded Goldreich‡ Amit Sahaik Add to Reading List Source URL: www.boazbarak.org Language: English - Date: 2012-08-02 17:50:31 Complexity classes Computability theory Theory of computation Pseudorandomness Models of computation Obfuscated code Oracle machine Algorithm P Theoretical computer science Computational complexity theory Applied mathematics
22	Reproduced without access to the TeX macros. Ad-hoc macro definitions were used instead. THE BIT EXTRACTION PROBLEM OR t–RESILIENT FUNCTIONS (Preliminary Version) Benny Chor Oded Goldreich Johan Hastad Laboratory for Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2012-08-19 19:00:34 Applied mathematics Fourier analysis Randomness extractor Heat equation FO Finite model theory Mathematics
23	The Random Oracle Methodology, Revisited∗ Ran Canetti† Oded Goldreich‡ Shai Halevi§ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2003-08-01 15:32:21 Probability theory Advantage Oracle machine Standard model Oracle Corporation Pseudorandom function family Random function Computational complexity theory Pseudorandomness Cryptography Cryptographic hash functions Random oracle
24	Basing Non-Interactive Zero-Knowledge on (Enhanced) Trapdoor Permutations: The State of the art Oded Goldreich Abstract. The purpose of this article is to correct the inaccurate account of this subject that is provided Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-07-22 08:07:12 Cryptographic protocols Computational complexity theory Proof theory Complexity classes Combinatorics Interactive proof system IP Soundness Non-interactive zero-knowledge proof Theoretical computer science Cryptography Applied mathematics
25	On the (Im)possibility of Obfuscating Programs∗ Boaz Barak† Oded Goldreich‡ Amit Sahaik Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2010-07-29 14:23:20 Computability theory Complexity classes Models of computation Theory of computation Obfuscated code Algorithm Oracle machine Pseudorandom function family Computability Theoretical computer science Applied mathematics Computational complexity theory
26	Computational Complexity Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:18 Complexity classes Structural complexity theory Mathematical optimization Probabilistic complexity theory NP P versus NP problem P Bounded-error probabilistic polynomial Interactive proof system Theoretical computer science Computational complexity theory Applied mathematics
27	Introduction to Complexity Theory { Lecture Notes Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Email: [removed] July 31, 1999 Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2000-12-12 06:50:00 Complexity classes Mathematical optimization Structural complexity theory NP-complete Polynomial-time reduction P versus NP problem NP P-complete Probabilistically checkable proof Theoretical computer science Computational complexity theory Applied mathematics
28	Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. [removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:17 Complexity classes Computability theory Quantum complexity theory Descriptive complexity Kolmogorov complexity PP FO Function NP Theoretical computer science Computational complexity theory Applied mathematics
29	On Teaching the Basics of Complexity Theory (In Memory of Shimon Even [1935{2004]) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Israel. Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2014-06-22 06:25:22 Complexity classes NP-complete NP-hard P versus NP problem Co-NP NP Cook–Levin theorem Oracle machine Reduction Theoretical computer science Computational complexity theory Applied mathematics
30	Modern Cryptography, Probabilistic Proofs and Pseudorandomness (Second Edition – author’s copy) Oded Goldreich Department of Computer Science and Applied Mathematics Weizmann Institute of Science, Rehovot, Israel. Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2009-03-21 13:40:58 Pseudorandomness Mathematical logic Oded Goldreich Algorithmic information theory Pseudorandom generator Silvio Micali Probabilistically checkable proof Mathematical proof Randomness Theoretical computer science Applied mathematics Cryptography